The Hybrid Steepest Descent Method for Split Variational Inclusion and Constrained Convex Minimization Problems
نویسندگان
چکیده
منابع مشابه
A hybrid steepest descent method for constrained convex optimization
This paper describes a hybrid steepest descent method to decrease over time any given convex cost function while keeping the optimization variables into any given convex set. The method takes advantage of properties of hybrid systems to avoid the computation of projections or of a dual optimum. The convergence to a global optimum is analyzed using Lyapunov stability arguments. A discretized imp...
متن کاملA New Steepest Descent Differential Inclusion-Based Method for Solving General Nonsmooth Convex Optimization Problems
In this paper, we investigate a steepest descent neural network for solving general nonsmooth convex optimization problems. The convergence to optimal solution set is analytically proved. We apply the method to some numerical tests which confirm the effectiveness of the theoretical results and the performance of the proposed neural network.
متن کاملHybrid Steepest Descent Method for Solving Hierarchical Fixed Point Approach to Variational Inequalities Constrained Optimization Problem
An explicit hierarchical fixed point algorithm is introduced to solve the monotone variational inequality over the fixed point set of a nonexpansive mapping. This paper discusses a monotone variational inequality with variational constraint and convex optimization problems over the fixed point set of a nonexpansive mapping. The strong convergence for the proposed algorithm to the solution is gu...
متن کاملMann-type Steepest-descent and Modified Hybrid Steepest-descent Methods for Variational Inequalities in Banach Spaces
1Department of Mathematics, Shanghai Normal University, Shanghai; and Scientific Computing Key Laboratory of Shanghai Universities, Shanghai, China 2Department of Mathematics & Statistics, College of Science, King Fahd University of Petroleum & Minerals, Dhahran, Saudi Arabia; and Department of Mathematics, Aligarh Muslim University, Aligarh, India 3Department of Applied Mathematics, National S...
متن کاملAn Asymptotical Variational Principle Associated with the Steepest Descent Method for a Convex Function
The asymptotical limit of the trajectory deened by the continuous steepest descent method for a proper closed convex function f on a Hilbert space is characterized in the set of minimizers of f via an asymp-totical variational principle of Brezis-Ekeland type. The implicit discrete analogue (prox method) is also considered.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Abstract and Applied Analysis
سال: 2014
ISSN: 1085-3375,1687-0409
DOI: 10.1155/2014/365203